A New Linkless Hierarchical Structure based on Perfect Hashing
نویسندگان
چکیده
منابع مشابه
Linkless Octree Using Multi-Level Perfect Hashing
The standard C/C++ implementation of a spatial partitioning data structure, such as octree and quadtree, is often inefficient in terms of storage requirements particularly when the memory overhead for maintaining parentto-child pointers is significant with respect to the amount of actual data in each tree node. In this work, we present a novel data structure that implements uniform spatial part...
متن کاملUniversal Hashing and Perfect Hashing
Each of the key values x comes from a universe U , i.e. x ∈ U . In this document, we assume U = {1, 2, . . . N}. Observe that the set S is a dynamic set. Each of the Insert and Delete operations may modify the set. Hence the size of the set S changes with each operation. We bound the maximum size of the set to n (n << N). What are the data structures that can be used to store the set S? One opt...
متن کاملA Perfect Specialization Model for Gravity Equation in Bilateral Trade based on Production Structure
Although initially originated as a totally empirical relationship to explain the volume of trade between two partners, gravity equation has been the focus of several theoretic models that try to explain it. Specialization models are of great importance in providing a solid theoretic ground for gravity equation in bilateral trade. Some research papers try to improve specialization models by addi...
متن کاملtask-based language teaching in iran: a mixed study through constructing and validating a new questionnaire based on theoretical, sociocultural, and educational frameworks
جنبه های گوناگونی از زندگی در ایران را از جمله سبک زندگی، علم و امکانات فنی و تکنولوژیکی می توان کم یا بیش وارداتی در نظر گرفت. زبان انگلیسی و روش تدریس آن نیز از این قاعده مثتسنی نیست. با این حال گاهی سوال پیش می آید که آیا یک روش خاص با زیر ساخت های نظری، فرهنگی اجتماعی و آموزشی جامعه ایرانی سازگاری دارد یا خیر. این تحقیق بر اساس روش های ترکیبی انجام شده است.پرسش نامه ای نیز برای زبان آموزان ...
A practical perfect hashing algorithm
Hashing is a fundamental technique in Computer Science, and perfect hashing, which guarantees constant-time lookup, has particular theoretical and practical importance. The algorithm of Fredman, Komll os, and Szemer edi 8], augmented by Dietzfelbinger, et al. 7], is a simple perfect hashing scheme that has not seen extensive use due to poor practical performance. In this paper, we develop modii...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2018
ISSN: 2475-8841
DOI: 10.12783/dtcse/csae2017/17475